Robust Semidefinite Programming∗

نویسندگان

  • Aharon Ben-Tal
  • Laurent El Ghaoui
  • Arkadi Nemirovski
چکیده

In this paper, we consider semidefinite programs where the data is only known to belong to some uncertainty set U . Following recent work by the authors, we develop the notion of robust solution to such problems, which are required to satisfy the (uncertain) constraints whatever the value of the data in U . Even when the decision variable is fixed, checking robust feasibility is in general NP-hard. For a number of uncertainty sets U , we show how to compute robust solutions, based on a sufficient condition for robust feasibility, via SDP. We detail some cases when the sufficient condition is also necessary, such as linear programming or convex quadratic programming with ellipsoidal uncertainty. Finally, we provide examples, taken from interval computations and truss topology design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets

Consider the N -person non-cooperative game in which each player’s cost function and the opponents’ strategies are uncertain. For such an incomplete information game, the new solution concept called a robust Nash equilibrium has attracted much attention over the past several years. The robust Nash equilibrium results from each player’s decision-making based on the robust optimization policy. In...

متن کامل

Sequential Semidefinite Program for Robust Truss Optimization based on Robustness Functions associated with Stress Constraints

A robust truss optimization scheme, as well as an optimization algorithm, is presented based on the robustness function. Under the uncertainties of external forces based on the info-gap model, the maximization problem of robustness function is formulated as the optimization problem with infinitely many constraint conditions. By using a semidefinite relaxation technique, we reformulate the prese...

متن کامل

Robust Multiloop PID Controller Design: A Successive Semidefinite Programming Approach

The problem of robust multiloop proportional-integral-derivative (PID) controller tuning for multivariable processes is addressed in this paper. The problem is formulated in the H∞ control framework, and the controller parameters are determined based on both user-specified performance and robust stability. The PID settings are computed by solving a nonlinear optimization problem with matrix ine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008